Reconstruction of Undersampled MR Data using Lp (0<p<1) Spatial Constraints

نویسندگان

  • G. Adluru
  • M. Rosen
  • H. Song
چکیده

Introduction: L1 norm constrained reconstruction/compressed sensing techniques [1, 2] have recently been proposed to accelerate data acquisitions in MRI by acquiring fewer data in k-space. Image artifacts due to k-space undersampling are resolved by minimizing L1 norm of the sparse image estimate while preserving fidelity to the acquired data. Using an L1 norm constraint exploits implicit sparsity in the data [3]. More recent developments to this approach include (i) using a priori information about the signal [4,5] (ii) re-weighting the signal [6] (iii) reordering the signal estimate [7,8] which enhance signal sparsity and improve the reconstructions. In a different direction, it has been suggested that an Lp (0<p<1) constraint can obtain faithful reconstructions when undersampling is more severe [9]. Theory suggests that the minimum number of measurements required to obtain good reconstructions can be reduced as p is reduced [10]. In ref. [9] results were presented using simulations in which L0.5 constraint lead to significantly improved reconstructions over the corresponding L1 norm reconstructions. Here we test the feasibility of using Lp constraint on MR Cartesian acquisitions and compare the results to those from the more standard L1 norm constraint.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data reordering for improved constrained reconstruction from undersampled k-space data

Introduction: There has always been interest in speeding the acquisition of MRI data by acquiring fewer data in k-space. Recently there has been a significant interest in applying inverse problem techniques to reconstructing images from undersampled k-space MRI data [1-6]. One class of methods, from the nascent field of compressed sensing, is based on the sparse representation of images. As an ...

متن کامل

Reconstruction of 3D dynamic contrast-enhanced magnetic resonance imaging using nonlocal means.

PURPOSE To develop and test a nonlocal means-based reconstruction algorithm for undersampled 3D dynamic contrast-enhanced (DCE) magnetic resonance imaging (MRI) of tumors. MATERIALS AND METHODS We propose a reconstruction technique that is based on the recently proposed nonlocal means (NLM) filter which can relax trade-offs in spatial and temporal resolutions in dynamic imaging. Unlike the or...

متن کامل

MR Image Reconstruction Using Block Matching and Adaptive Kernel Methods

An approach to Magnetic Resonance (MR) image reconstruction from undersampled data is proposed. Undersampling artifacts are removed using an iterative thresholding algorithm applied to nonlinearly transformed image block arrays. Each block array is transformed using kernel principal component analysis where the contribution of each image block to the transform depends in a nonlinear fashion on ...

متن کامل

A Weighted Two-Level Bregman Method with Dictionary Updating for Nonconvex MR Image Reconstruction

Nonconvex optimization has shown that it needs substantially fewer measurements than l 1 minimization for exact recovery under fixed transform/overcomplete dictionary. In this work, two efficient numerical algorithms which are unified by the method named weighted two-level Bregman method with dictionary updating (WTBMDU) are proposed for solving lp optimization under the dictionary learning mod...

متن کامل

MR Image Reconstruction Based on Iterative Split Bregman Algorithm and Nonlocal Total Variation

This paper introduces an efficient algorithm for magnetic resonance (MR) image reconstruction. The proposed method minimizes a linear combination of nonlocal total variation and least-square data-fitting term to reconstruct the MR images from undersampled k-space data. The nonlocal total variation is taken as the L 1-regularization functional and solved using Split Bregman iteration. The propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008